\beamer@endinputifotherversion {3.07pt}
\select@language {spanish}
\beamer@sectionintoc {1}{Introducci\'on}{4}{0}{1}
\beamer@sectionintoc {2}{Fundamentos de Complejidad Algor\IeC {\'\i }tmica}{6}{0}{2}
\beamer@subsectionintoc {2}{1}{Introducci\'on}{6}{0}{2}
\beamer@subsectionintoc {2}{2}{Notaciones Asint\'oticas}{9}{0}{2}
\beamer@subsectionintoc {2}{3}{Operaciones entre \'Ordenes}{11}{0}{2}
\beamer@sectionintoc {3}{Calculo de Complejidad de Algoritmos Iterativos}{16}{0}{3}
\beamer@sectionintoc {4}{C\'alculo de Complejidad de Algoritmos Recursivos}{18}{0}{4}
\beamer@subsectionintoc {4}{1}{Ecuaciones de Recurrencia}{18}{0}{4}
\beamer@subsectionintoc {4}{2}{Teorema Maestro}{20}{0}{4}
\beamer@sectionintoc {5}{Complejidad Computacional y Computabilidad}{22}{0}{5}
\beamer@subsectionintoc {5}{1}{Complejidad Computacional}{22}{0}{5}
\beamer@subsectionintoc {5}{2}{Computabilidad}{27}{0}{5}
\beamer@sectionintoc {6}{Sumario}{28}{0}{6}
